The Hypermetric Cone on 8 Vertices and Some Generalizations
نویسنده
چکیده
The lists of facets – 298, 592 in 86 orbits – and of extreme rays – 242, 695, 427 in 9, 003 orbits – of the hypermetric cone HY P8 are computed. The first generalization considered is the hypermetric polytope HY PPn for which we give general algorithms and a description for n ≤ 8. Then we shortly consider generalizations to simplices of volume higher than 1, hypermetric on graphs and infinite dimensional hypermetrics.
منابع مشابه
The Hypermetric Cone on Seven Vertices
The hypermetric cone HY Pn is the set of vectors (dij)1≤i<j≤n satisfying the inequalities
متن کاملFacets for the cut cone I
We study facets of the cut cone C,, i.e., the cone of dimension 1⁄2n(n 1) generated by the cuts of the complete graph on n vertices. Actually, the study of the facets of the cut cone is equivalent in some sense to the study of the facets of the cut polytope. We present several operations on facets and, in particular, a "'lifting" procedure for constructing facets of C~ +1 from given facets of t...
متن کاملThe six-dimensional Delaunay polytopes
Given a lattice L, a full dimensional polytope P is called a Delaunay polytope if the set of its vertices is S ∩ L with S being an empty sphere of the lattice. Extending our previous work [DD01] on the hypermetric cone HY P7, we classify the six-dimensional Delaunay polytopes according to their combinatorial type. The list of 6241 combinatorial types is obtained by a study of the set of faces o...
متن کاملFacets for the cut cone II: Clique-web inequalities
We study new classes of facets for the cut cone C, generated by the cuts of the complete graph on n vertices. This cone can also be interpreted as the cone of all semi-metrics on n points that are isometrically l~-embeddable and, in fact, the study of the facets of the cut polytope is in some sense equivalent to the study of the facets of C~. These new facets belong to the class of clique-web i...
متن کاملA Bound on the K-gonality of Facets of the Hypermetric Cone and Related Complexity Problems
We give a bound on g h (n), the largest integer such that there is a g h (n)-gonal facet of the hypermetric cone Hyp n , g h (n) 2 n?2 (n?1)! This proves simultaneously the polyhedrality of the hypermetric cone. We give complete description of Delau-nay polytopes related to facets of Hyp n. We prove that the problem determining hypermetricity lies in co-NP and give some related NP-hard problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015